Message-generated Kripke semantics
نویسندگان
چکیده
We show how to generate multi-agent Kripke models from message exchanges. With these models we can analyze the epistemic consequences of a message exchange. One novelty in this approach is that we include the messages in our logical language. This allows us to model messages that mention other messages and agents that reason about messages. Our framework can be used to model a wide range of different communication scenarios.
منابع مشابه
Message - Generated Kripke Semantics — Draft , do not quote or circulate please
We show how to generate multi-agent Kripke models from message exchanges, and conversely, how to interpret message exchanges with respect to initial multi-agent Kripke models. Any multimodal S5 Kripke model is a suitable initial model for updating by means of message exchange.
متن کاملA Completeness Result for BAN Logic
BAN logic is a propositional logic of knowledge for the verification of cryptographic protocols. While BAN logic has been successful from a practical point of view, the semantics of the epistemic (knowledge) modality is unclear. Several Kripke semantics have been proposed, but they do not attempt at anything beyond a soundness result. Completeness is prevented by the so called logical omniscien...
متن کاملReasoning about knowledge and messages in 1 asynchronous multi - agent systems
We propose a variant of public announcement logic for asynchronous systems. To capture 12 asynchrony, we introduce two different modal operators for sending and receiving messages. 13 The natural approach to defining the semantics leads to a circular definition, but we describe 14 two restricted cases in which we solve this problem. The first case requires the Kripke model 15 representing the i...
متن کاملA Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph recording a computation in the pi-calculus. Each node represents a process, and each edge either represents a computation step, or a message-passing interaction. P...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011